The Priority Broadcast Scheme for Dynamic Broadcast in Hypercubes and Related Networks

نویسندگان

  • Chi-Hsiang Yeh
  • Emmanouel A. Varvarigos
  • Hua Lee
چکیده

Dynamic broadcast is a communication problem where each node in a parallel computer generates packets to be broadcast to all the other nodes according to a certain random process. The lower bound on the average time required by any oblivious dynamic broadcast algorithm in an ndimensional hypercube is Ω(n+ 1 1 ρ)when packets are generated according to a Poisson process, where ρ is the load factor. The best previous algorithms, however, only achieve Ω( n 1 ρ) time, which is suboptimal by a factor of Θ(n). In this paper, we propose the priority broadcast scheme for designing dynamic broadcast algorithms that require optimal O(n + 1 1 ρ) time in an n-dimensional hypercube. We apply the routing scheme to other network topologies, including k-ary n-cubes, meshes, tori, star graphs, generalized hypercubes, as well as any symmetric network, for efficient dynamic broadcast. In particular, the algorithms for star graphs, generalized hypercubes, and k-ary n-cubes with k = O(1) are also asymptotically optimal. We also propose a method for assigning priority classes to packets, called optimal priority assignment, which achieves the best possible performance for dynamic multiple broadcast in any network topology.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design and formal verification of DZMBE+

In this paper, a new broadcast encryption scheme is presented based on threshold secret sharing and secure multiparty computation. This scheme is maintained to be dynamic in that a broadcaster can broadcast a message to any of the dynamic groups of users in the system and it is also fair in the sense that no cheater is able to gain an unfair advantage over other users. Another important feature...

متن کامل

Broadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach

While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...

متن کامل

Reliability based budgeting with the case study of TV broadcast

Planning budget will help to identify wasteful expenditures, adapt financial situation changes quickly, and achieve financial goals. The reliability based budgeting has a great importance for broadcasting industry. In this study, several kinds of failure modes in TV broadcasting system have been det...

متن کامل

An Optimal Routing Scheme for Multiple Broadcast

The dynamic broadcast problem is the communication problem where source packets to be broadcast to all the other nodes are generated at each node of a parallel computer according to a certain random process, such as a Poisson process. The lower bounds on the average reception delay required by any oblivious dynamic broadcast algorithm in a d-dimensional hypercube are Ω(d + 1 1 ρ) when packets a...

متن کامل

Girth, minimum degree, independence, and broadcast independence

An independent broadcast on a connected graph $G$is a function $f:V(G)to mathbb{N}_0$such that, for every vertex $x$ of $G$, the value $f(x)$ is at most the eccentricity of $x$ in $G$,and $f(x)>0$ implies that $f(y)=0$ for every vertex $y$ of $G$ within distance at most $f(x)$ from $x$.The broadcast independence number $alpha_b(G)$ of $G$is the largest weight $sumlimits_{xin V(G)}f(x)$of an ind...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999